- Title
- MaxDDBS problem on butterfly networks
- Creator
- Bong, Novi H.; Miller, Mirka; Ryan, Joe; Sugeng, Kiki A.
- Relation
- Australasian Journal of Combinatorics Vol. 68, p. 245-264
- Relation
- https://ajc.maths.uq.edu.au/?page=get_volumes&volume=68
- Publisher
- Centre for Discrete Mathematics & Computing
- Resource Type
- journal article
- Date
- 2017
- Description
- A maximum degree-diameter bounded subgraph problem can be seen as a degree-diameter problem restricted to certain host graphs. In this paper, we investigate the MaxDDBS problem when the host graph is a butterfly network. We give constructive lower bounds for subgraphs of maximum degree 4, 3 and 2.
- Subject
- degree diameter problem; subgraphs; bounded subgraphs; nypercube networks
- Identifier
- http://hdl.handle.net/1959.13/1399774
- Identifier
- uon:34673
- Identifier
- ISSN:2202-3518
- Language
- eng
- Reviewed
- Hits: 925
- Visitors: 911
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|